Optimal regularized low rank inverse approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal regularized low rank inverse approximation

Article history: Received 5 September 2013 Accepted 19 July 2014 Available online 5 August 2014 Submitted by C. Greif MSC: 65F22 15A29

متن کامل

Regularized structured low-rank approximation with applications

We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among others. We impose the low-rank by modeling the approximation as a product of two factors with reduced dimension. The structure of the low-rank model is enforc...

متن کامل

An Efficient Approach for Computing Optimal Low-Rank Regularized Inverse Matrices

Standard regularization methods that are used to compute solutions to ill-posed inverse problems require knowledge of the forward model. In many real-life applications, the forward model is not known, but training data is readily available. In this paper, we develop a new framework that uses training data, as a substitute for knowledge of the forward model, to compute an optimal low-rank regula...

متن کامل

Sparse Principal Component Analysis via Regularized Low Rank Matrix Approximation

Principal component analysis (PCA) is a widely used tool for data analysis and dimension reduction in applications throughout science and engineering. However, the principal components (PCs) can sometimes be difficult to interpret, because they are linear combinations of all the original variables. To facilitate interpretation, sparse PCA produces modified PCs with sparse loadings, i.e. loading...

متن کامل

Regularized Low Rank Approximation of Weighted Data Sets

In this paper we propose a fast and accurate method for computing a regularized low rank approximation of a weighted data set. Unlike the non-weighted case, the optimization problem posed to obtain a low rank approximation for weighted data may have local minima. To alleviate the problem with local minima, and consequently to obtain a meaningful solution, we use a priori information about the d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.07.024